MöbiusE: Knowledge Graph Embedding on Möbius Ring

نویسندگان

چکیده

In this work, we propose a novel Knowledge Graph Embedding (KGE) strategy, called M\"{o}biusE, in which the entities and relations are embedded to surface of M\"{o}bius ring. The proposition such strategy is inspired by classic TorusE, addition two arbitrary elements subject modulus operation. sense, TorusE naturally guarantees critical boundedness embedding vectors KGE. However, nonlinear property operation on Torus ring uniquely derived operation, some extent restricts expressiveness TorusE. As further generalization M\"{o}biusE also uses preserve closeness it, but coordinates interacts with each other following way: {\em \color{red} any vector moves along its parametric trace will goes right opposite direction after cycle}. Hence, assumes much more representativeness than that turn it generates precise results. our experiments, outperforms strategies several key indicators.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge Graph Embedding by Translating on Hyperplanes

We deal with embedding a large scale knowledge graph composed of entities and relations into a continuous vector space. TransE is a promising method proposed recently, which is very efficient while achieving state-of-the-art predictive performance. We discuss some mapping properties of relations which should be considered in embedding, such as reflexive, one-to-many, many-to-one, and many-to-ma...

متن کامل

Semantically Smooth Knowledge Graph Embedding

This paper considers the problem of embedding Knowledge Graphs (KGs) consisting of entities and relations into lowdimensional vector spaces. Most of the existing methods perform this task based solely on observed facts. The only requirement is that the learned embeddings should be compatible within each individual fact. In this paper, aiming at further discovering the intrinsic geometric struct...

متن کامل

Context-Dependent Knowledge Graph Embedding

We consider the problem of embedding knowledge graphs (KGs) into continuous vector spaces. Existing methods can only deal with explicit relationships within each triple, i.e., local connectivity patterns, but cannot handle implicit relationships across different triples, i.e., contextual connectivity patterns. This paper proposes context-dependent KG embedding, a twostage scheme that takes into...

متن کامل

GAKE: Graph Aware Knowledge Embedding

Knowledge embedding, which projects triples in a given knowledge base to d-dimensional vectors, has attracted considerable research efforts recently. Most existing approaches treat the given knowledge base as a set of triplets, each of whose representation is then learned separately. However, as a fact, triples are connected and depend on each other. In this paper, we propose a graph aware know...

متن کامل

Knowledge Graph and Text Jointly Embedding

We examine the embedding approach to reason new relational facts from a largescale knowledge graph and a text corpus. We propose a novel method of jointly embedding entities and words into the same continuous vector space. The embedding process attempts to preserve the relations between entities in the knowledge graph and the concurrences of words in the text corpus. Entity names and Wikipedia ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Knowledge Based Systems

سال: 2021

ISSN: ['1872-7409', '0950-7051']

DOI: https://doi.org/10.1016/j.knosys.2021.107181